a=input()
b=input()
l=[]
for i in range(len(a)):
if(a[i]==b[i]):
l.append(0)
else:
l.append(1)
print(*l,sep='')#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
string ch1, ch2;
cin>>ch1>>ch2;
int n;
n=sizeof(ch1);
for (size_t i=0 ;i<ch1.size();i++)
if (ch1[i]==ch2[i]){
ch1[i]='0';
}
else {
ch1[i]='1';
}
cout<<ch1;
return 0;
}1469A - Regular Bracket Sequence | 919C - Seat Arrangements |
1634A - Reverse and Concatenate | 1619C - Wrong Addition |
1437A - Marketing Scheme | 1473B - String LCM |
1374A - Required Remainder | 1265E - Beautiful Mirrors |
1296A - Array with Odd Sum | 1385A - Three Pairwise Maximums |
911A - Nearest Minimums | 102B - Sum of Digits |
707A - Brain's Photos | 1331B - Limericks |
305B - Continued Fractions | 1165B - Polycarp Training |
1646C - Factorials and Powers of Two | 596A - Wilbur and Swimming Pool |
1462B - Last Year's Substring | 1608B - Build the Permutation |
1505A - Is it rated - 2 | 169A - Chores |
765A - Neverending competitions | 1303A - Erasing Zeroes |
1005B - Delete from the Left | 94A - Restoring Password |
1529B - Sifid and Strange Subsequences | 1455C - Ping-pong |
1644C - Increase Subarray Sums | 1433A - Boring Apartments |